：Considering a sparse of m×n matrix with t non-zero terms, the time complexity of TRANSPOSE algorithm is:A:O(nt)B:O(n-t)C:O(n*t)D:O(n+t)答案: O(n*t)10、